t = int(input()) for i in range(t):
a, b, n, s = list(map(int, input().split())) if s % n <= b and a * n + b >= s:
print("Yes")
else:
print("No")#include<bits/stdc++.h>
using namespace std;
int main()
{
int p;
cin>>p;
while(p--)
{
int a,b,n,s;
cin>>a>>b>>n>>s;
if(min(s/n,a)*n+b>=s) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}22A - Second Order Statistics | 1720B - Interesting Sum |
1720A - Burenka Plays with Fractions | 3A - Shortest path of the king |
1720C - Corners | 574A - Bear and Elections |
352B - Jeff and Periods | 1244A - Pens and Pencils |
1670A - Prof Slim | 1189A - Keanu Reeves |
678A - Johny Likes Numbers | 1699C - The Third Problem |
1697D - Guess The String | 754B - Ilya and tic-tac-toe game |
760A - Petr and a calendar | 1573A - Countdown |
166A - Rank List | 1631B - Fun with Even Subarrays |
727A - Transformation from A to B | 822B - Crossword solving |
1623A - Robot Cleaner | 884B - Japanese Crosswords Strike Back |
862B - Mahmoud and Ehab and the bipartiteness | 429A - Xor-tree |
1675C - Detective Task | 950A - Left-handers Right-handers and Ambidexters |
672B - Different is Good | 1C - Ancient Berland Circus |
721A - One-dimensional Japanese Crossword | 1715B - Beautiful Array |